Deterministic pushdown automaton - PDFSEARCH.IO - Document Search Engine

Deterministic pushdown automaton
Results: 48

#	Item
31	Deciding equivalence using type checking Colin Stirling [removed] LFCS School of Informatics University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-06-30 04:38:21 Model checking Finite-state machine Automata theory Models of computation Deterministic pushdown automaton
32	jn[removed]Finite automata with external storage Concepts of this chapter: Finite automata with external storage of unbounded capacity, subject to various access restrictions that limit the automa’s power of compu Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:14 Theoretical computer science Deterministic pushdown automaton Nondeterministic finite automaton Finite-state machine Turing machine Linear bounded automaton Alphabet Queue automaton Counter automaton Automata theory Theory of computation Models of computation
33	Theory of computation: Summary of main concepts 5. Context-free languages, grammars and pushdown automata fsm Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:10 Models of computation Computer science Context-free language Deterministic pushdown automaton Pushdown automaton Context-free grammar Theory of computation SC CYK algorithm Formal languages Theoretical computer science Automata theory
34	Deterministic Pushdown Automata 237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if Add to Reading List Source URL: www.cs.uiuc.edu Language: English - Date: 2005-10-18 14:54:39 Models of computation Computer science Applied mathematics Deterministic pushdown automaton Regular language Regular expression Context-free language Automata theory Formal languages Theoretical computer science
35	1 Book Title Book Editors IOS Press, 2003 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-05-20 09:50:25 Applied mathematics Computer science Deterministic pushdown automaton Pushdown automaton Bisimulation Graph Nested word Automata theory Models of computation Theoretical computer science
36	Deciding DPDA Equivalence is Primitive Recursive Colin Stirling Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-05-20 09:52:43 Symbol Pushdown automaton Constructible universe Ordinal number Automata theory Models of computation Deterministic pushdown automaton
37	Language Theory and Innite Graphs Colin Stirling S hool of Informati s Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-05-20 09:50:17 Applied mathematics Mathematics Deterministic pushdown automaton Pushdown automaton Bisimulation Graph Models of computation Automata theory Theoretical computer science
38	Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-05-20 09:59:44 Applied mathematics Computer science Deterministic pushdown automaton Bisimulation Computability Context-free language Finite-state machine Automata theory Models of computation Theoretical computer science
39	1 Language Theory and Infinite Graphs Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-02-02 08:38:30 Logic in computer science Deterministic pushdown automaton Constructible universe Symbol Bisimulation Computer science Theoretical computer science Automata theory Applied mathematics
40	1 Language Theory and Infinite Graphs Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-02-02 08:38:25 Mathematics Norm Deterministic pushdown automaton Constructible universe Symbol Formal languages Theoretical computer science Computer science Topological vector spaces Automata theory Linear algebra Models of computation

UPDATE